This file is to accompany supplements for "Some enumerations of binary digital images" by P. Christopher Staecker.

You should have three JSON files and one sage worksheet.

allpointedirred.json
--------------------
This is a JSON file listing all pointed-irreducible graphs on 9 vertices or fewer. The file is a single JSON list of tuples looking like:
[s, p, m, r]
- s is a the graph6 string for a graph
- p is a list of the graph's original vertices
- m is a list of the vertices remaining after a minimal reduction 
  (so if p == m, then the graph is irreducible)
- r is a boolean telling whether or not the graph is rigid

4images.json
------------
This is a JSON file listing all digital images in Z^2 with 4-adjacency, along with their reductions. The file is a single JSON list of tuples looking like:
[i, p, m, r]
- i is a list of ordered pairs giving coordinates of the pixels in 
  an image
- p is a sublist of i giving a pointed reduction
- m is a sublist of p giving a minimal reduction
- r is a boolean telling whether or not the graph is rigid

8images.json
------------
Same as 4images.json, but for images in Z^2 with 8-adjacency.

Digital image enumerations.sws
------------------------------
Sage worksheet from which the above 3 json files were computed. Should contain everything you need to play around and reduce other graphs too, though execution will typically be slow for graphs with lots (>8) of edges.


All of this code and data is free to use by anyone for any purpose.